A tight quantitative version of Arrow’s impossibility theorem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A tight quantitative version of Arrow's impossibility theorem

The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a dictatorship, is necessarily nontransitive. In 2002, Kalai asked whether one can obtain the following quantitative version of the theorem: For any > 0, there exists δ =...

متن کامل

Dice games and Arrows theorem

We observe that non-transitivity is not the most general way that Arrow’s impossibility theorem is re‡ected in dice games. Non-transitivity in dice games is a well-known phenomenon. It was described in several Scienti…c American columns in the 1970s, beginning with [3], and has since become a popular topic, discussed in articles like [4, 5] and textbooks on elementary mathematics and probabilit...

متن کامل

A More General Version of the Costa Theorem

In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...

متن کامل

Arrow’s Impossibility Theorem

Let A, B′ be non empty sets, let B be a non empty subset of B ′, let f be a function from A into B, and let x be an element of A. Then f(x) is an element of B. Next we state two propositions: (1) For every finite set A such that cardA ≥ 2 and for every element a of A there exists an element b of A such that b 6= a. (2) Let A be a finite set. Suppose cardA ≥ 3. Let a, b be elements of A. Then th...

متن کامل

A quantitative version of the Roth-Ridout theorem

We shall show that there is a effectively computable upper bound of the heights of solutions for an inequality in Roth-Ridout’s theorem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the European Mathematical Society

سال: 2012

ISSN: 1435-9855

DOI: 10.4171/jems/334